Data card verification system

ABSTRACT

A method of verifying a pair of correspondents in electronic transaction, the correspondents each including first and second signature schemes and wherein the first signature scheme is computationally more difficult in signing than verifying and the second signature scheme is computationally more difficult in verifying than signing. The method comprises the step of the first correspondent signing information according to the first signature scheme and transmitting the first signature to the second correspondent, the second correspondent verifying the first signature received from the first correspondent, wherein the verification is performed according to the first signature scheme. The second correspondent then signs information according to the second signature scheme and transmits the second signature to the first correspondent, the first correspondent verifies the second signature received from the second correspondent, wherein the verification is performed according to the second signature algorithm; the transaction is rejected if either verification fails. The method thereby allows one of the correspondents to participate with relatively little computing power while maintaining security of the transaction.

CROSS REFERENCE TO RELATED APPLICATIONS

This is a continuation application of U.S. patent application Ser. No. 13/609,153 filed Sep. 10, 2012, which is a continuations of U.S. patent application Ser. No. 12/892,719 filed Sep. 28, 2010, which is a continuation of U.S. patent application Ser. No. 12/324,232 filed Nov. 26, 2008 and issued under U.S. Pat. No. 7,822,987 on Oct. 26, 2010, which is a divisional of U.S. patent application Ser. No. 10/185,042 filed on Jul. 1, 2002 and issued under U.S. Pat. No. 7,472,276 on Dec. 30, 2008, which is a divisional of U.S. patent application Ser. No. 09/716,223 filed on Nov. 21, 2000, now abandoned, which is a divisional of U.S. patent application Ser. No. 09/016,926 filed on Feb. 2, 1998 and issued under U.S. Pat. No. 6,178,507 on Jan. 23, 2001, which claims priority from United Kingdom Patent Application No. 9702152.1 filed on Feb. 3, 1997 all of which are hereby incorporated by reference.

BACKGROUND OF THE INVENTION

It has become widely accepted to conduct transactions such as financial transactions or exchange of documents electronically. Automated teller machines (ATMs) and credit cards are widely used for personal transaction and as their use expands so too does the need to verify such transactions increase. A smart card is somewhat like a credit card and includes some processing and storage capability. Smart cards are prone to fraudulent misuse. For example by a dummy terminal which is used to glean information from an unsuspecting user. Thus, before any exchange of critical information takes place between either a terminal and smart card or vice versa it is necessary to verify the authenticity of the terminal as well as the card. One of these verification may take the form of “signing” an initial transaction digitally so that the authenticity of the transaction can be verified by both parties involved in the subsequent session. The signature is performed according to a protocol that utilizes a random message, i.e. the transaction and a secret key associated with the party.

The signature must be performed such that the party's secret key cannot be determined. To avoid the complexity of disturbing secret keys, it is convenient to utilize a public key encryption scheme in the generation of the signature. Such capabilities are available where the transaction is conducted between parties having access to the relatively large computing resources, but it is equally important to facilitate such transactions at an individual level where more limited computing resources available, as in the smart card.

Transaction cards or smart cards are now available with limited computing capacity, but these are not sufficient to implement existing digital signature protocols in a commercially viable manner. As noted above, in order to generate a verification signature it is necessary to utilize a public key inscription scheme. Currently, most public key schemes are based on RSA, but the DSS and the demand for a more compact system are rapidly changing this. The DSS scheme, which is an implementation of a Diffie-Hellman public key protocol, utilizes the set of integers Z_(p) where p is a large prime. For adequate security, p must be in the order of 512 bits, although the resultant signature may be reduced mod q, where q divides p−1, and may be in the order of 160 bits.

An alternative encryption scheme which was one of the first fully fledged public key algorithms and which works for encryption as well as for digital signatures is known as the RSA algorithm. RSA gets its security from the difficulty of factoring large numbers. The public and private keys are functions of a pair of large (100 to 200 digits or even larger) of prime numbers. The public key for RSA encryption is n, the product of the two primes p and q where p and q must remain secret and e which is relatively prime to (p−1)×(q−1). The encryption key d is equal to e⁻¹(mod (p−1)×(q−1)). Note that d and n are relatively prime.

To encrypt a message m, first divide it into a number of numerical blocks such that each block is a unique representation modulo n, then the encrypted message block c_(i), is simply m_(i) ^(e)(mod n). To decrypt a message take each encrypted block c_(i) and compute m _(i)=c _(i) ^(d)(mod n).

Another encryption scheme that provides enhanced security at relatively small modulus is that utilizing elliptic curves in the finite field 2 ^(m). A value of m in the order of 155 provides security comparable to a 512 bit modulus DSS and therefore offers significant benefits in implementation.

Diffie-Hellman public key encryption utilizes the properties of discrete logs so that even if a generator β and the exponentiation β^(k) is known, the value of k cannot be determined. A similar property exist with elliptic curves where the addition of two points on any curve produces a third point on the curve. Similarly, multiplying a point P on the curve by an integer k produces a further point on the curve. For an elliptic curve, the point kP is simply obtained by adding k copies of the point P together.

However, knowing the starting point and the end point does not reveal the value of the integer k which may then be used as a session key for encryption. The value kP, where P is an initial known point is therefore equivalent to the exponentiation β^(k). Furthermore, elliptic curve crypto-systems offer advantages over other key crypto-systems when bandwidth efficiency, reduced computation and minimized code space are application goals.

Furthermore, in the context of a smart card and an automated teller machine transaction, there are two major steps involved in the authentication of both parties. The first is the authentication of the terminal by the smart card and the second is the authentication of the smart card by the terminal. Generally, this authentication involves the verification of a certificate generated by the terminal and received by the smart card and the verification of a certificate signed by the smart card and verified by the terminal. Once the certificates have been positively verified the transaction between the smart card and the terminal may continue.

Given the limited processing capability of the smart card, verifications and signature processing performed on the smart card are generally limited to simple encryption algorithms. A more sophisticated encryption algorithm is generally beyond the scope of the processing capabilities contained within the smart card. Thus, there exist a need for a signature verification and generation method which may be implemented on a smart card and which is relatively secure.

SUMMARY OF THE INVENTION

This invention seeks in one aspect to provide a method of data verification between a smart card and a terminal.

In accordance with this aspect there is provided a method for verifying a pair of participants in an electronic transaction, comprising the steps of verifying information received by the second participant from the first participant, wherein the-verification is performed according to a first signature algorithm; verifying information received by the first participant from the second participant, wherein the verification is performed according to a second signature algorithm; and whereby the transaction is rejected if either verification fails.

The first signature algorithm may be one which is computationally more difficult in signing than verifying, while the second signature algorithm is more difficult in verifying than signing. In such an embodiment the second participant may participate with relatively little computing power, while security is maintained at a high level.

In a further embodiment, the first signature algorithm is based on an RSA, or DDS type algorithm, and the second signature algorithm is based on an elliptic curve algorithm.

BRIEF DESCRIPTION OF THE DRAWINGS

An embodiment of the invention will now be described by way of example on the reference to the accompanying drawings, in which,

FIG. 1 a is a schematic representations showing a smart card and terminal;

FIG. 1 b is a schematic representations showing the sequence of events performed during the verification process in a smart card transaction system; and

FIG. 2 is a detailed schematic representation showing a specific protocol.

DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT

Referring to FIG. 1( a), a terminal 100 is adapted to receive a smart card 102. Typically, insertion of the card 102 into the terminal initiates a transaction. Mutual authentication between the terminal and the card is then performed as shown in FIG. 1 b. In very general terms, this mutual authentication is performed according to a “challenge-response” protocol. Generally, card transmits information to the terminal, the terminal 100 signs information with an RSA based algorithm 112 and is then sent to the card 102, which verifies the information with an RSA based algorithm 114. The information exchange 116 between the card and the terminal also includes information generated by the card which is sent to the terminal to be signed by the terminal with an RSA algorithm and returned to the card to be verified utilizing a RSA algorithm. Once the relevant verification has been performed 118, a further step is performed where information is signed by the card using an elliptic curve encryption protocol 120 and submitted to the terminal to be verified 124 by the terminal utilizing an elliptic curve based protocol. Similarly, the information exchange 122 between the card and the terminal may include information generated by the terminal which is sent to the card to be signed by the card and returned to the terminal for verification. Once the appropriate information has been verified 126 the further transactions between the terminal and card may proceed 128.

Referring now to FIG. 2, a detailed implementation of the mutual authentication of the terminal and the card, according to the “challenged-response” protocol is shown generally by numeral 200. The terminal 100 is first verified by the card 102 and the card is then verified by the terminal. The terminal first sends to the card a certificate C₁, 20 containing its ID, T_(ID), and public information including the public key. The certificate 20 may be also signed by a certifying authority (CA) so that the card may verify the association of the terminal ID T_(ID) with the public key received from the terminal. The keys used by the terminal and the CA in this embodiment may both be based on the RSA algorithm.

With the RSA algorithm each member or party has a public and a private key, and each key has two parts. The signature has the form:

S=m ^(d)(mod n)

where:

m is the message to be signed;

n a public key is the modulus and is the product of two primes p and q;

e the encryption key chosen at random and which is also public is a number chosen to be relatively prime to (p−1)×(q−1); and

d the private key which is congruent to e⁻¹(mod (p−1)×(q−1)).

For the RSA algorithm, the pair of integers (n,e) are the public key information that is used for signing. While, the pair of integers (d,n) may be used to decrypt a message which has been encrypted with the public key information (n,e).

Referring back to FIG. 2, the numbers n and e are the public keys of the CA and may be set as system parameters. The public key e may be either stored in the smart card or in an alternate embodiment hardwired into an logic circuit in the card. Furthermore, by choosing e to be relatively small, ensures that the exponentiation may be carried out relatively quickly.

The certificate 20 C₁ is signed by the CA and has the parameters (n,e). The certificate contains the terminal ID T_(Id), and the terminal public key information T_(n) and T_(e) which is based on the RSA algorithm. The certificate C₁ is verified 24 by the card extracting T_(ID), T_(n), T_(c). This information is simply extracted by performing C_(i) ^(e) mod n. The card then authenticates the terminal by generating a random number R1, 26, which it transmits to the terminal. The terminal signs the message R1 using its secret key T_(d) by performing R1 ^(T) ^(e) MODT_(n) to generate the value C₂, 28. Once again the key used by the terminal is an RSA key which has been originally created in such a way that the public key T_(e) consist of a small possibly system wide parameter having a value 3, while the other part of the public key is the modulus T_(n) which would be associated with the terminal. The terminals private key T_(d) cannot be small if it corresponds to a small public key T_(e). In the case of the terminal, it does not matter whether the private key T_(d) is chosen to be large as the terminal has the required computing power to perform the exponentiation relative quickly.

Once the terminal has calculated the value C₂, 28, it generates a secret random number R2, 29 the terminal sends both R2 and C₂, 32 to the card. The card then performs a modular exponentiation 34 on the signed value C₂ with the small exponent T_(e), using the terminal's modulus T_(n). This is performed by calculating R1′=C₂ ^(Te) mod T_(n). If R1′ is equal to R1, 36 then the card knows that it is dealing with the terminal whose ID T_(ID) is associated 38 with the modulus T_(n). The card generally contains a modulo arithmetic processor (not shown) to perform the above operation.

The secret random number R2 is signed 40 by the card and returned to the terminal along with a certificate signed by the CA which relates the card ID to its public information. The signing by the card is performed according to an elliptic curve signature algorithm.

The verification of the card proceeds on a similar basis as the verification of the terminal, however, the signing by the card utilizes an elliptic curve encryption system.

Typically for an elliptic curve implementation a signature component s has the form:

s=ae+k(mod n)

where:

P is a point on the curve which is a predefined parameter of the system;

k is a random integer selected as a short term private or session key, and has a corresponding short term public key R=kP;

a is the long term private key of the sender(card) and has a corresponding public key aP=Q;

e is a secure hash, such as the SHA hash function, of a message m (R2 in this case) and short term public key R; and

n is the order of the curve.

For simplicity it will be assumed that the signature component s is of the form s=ae+k as discussed above although it will be understood that other signature protocols may be used.

To verify the signature sP−eQ must be computed and compared with R. The card generates R, using for example a field arithmetic processor (not shown). The card sends to the terminal a message including m, s, and R, indicated in block 44 of FIG. 2 and the signature is verified by the terminal by computing the value (sP−eQ) 46 which should correspond to kP. If the computed values correspond 48 then the signature is verified and hence the card is verified and the transaction may continue.

The terminal checks the certificate, then it checks the signature of the transaction data which contains R2, thus authenticating the card to the terminal. In the present embodiment the signature generated by the card is an elliptic curve signature, which is easier for the card to generate, but requires more computation by the terminal to verify.

As is seen from the above equation, the calculation of s is relatively straightforward and does not require significant computing power. However in order to perform the verification it is necessary to compute a number of point multiplications to obtain sP and eQ, each of which is computationally complex. Other protocols, such as the MQV protocols require similar computations when implemented over elliptic curves which may result in slow verification when the computing power is limited. However this is generally not the case for a terminal.

Although an embodiment of the invention has been described with reference to a specific protocol for the verification of the terminal and for the verification of the card, other protocols may also be used. 

1. A method performed at a first computing device in a communication system, said method comprising: receiving a first signed message from a second computing device in said communication system, said first signed message generated using a signing algorithm of a first signature scheme; utilizing a verifying algorithm of said first signature scheme to verify said first signed message; signing a message by utilizing a signing algorithm of a second signature scheme different to said first signature scheme, to generate a second signed message, one of said first and second signature schemes being an elliptic curve signature scheme; sending said second signed message to said second computing device for verification of said second signed message using a verifying algorithm of said second signature scheme.
 2. The method of claim 1, wherein said signing algorithm of said first signature scheme is computationally more difficult than said verifying algorithm of said first signature scheme.
 3. The method of claim 1, wherein said signing algorithm of said second signature scheme is computationally more difficult than said verifying algorithm of said second signature scheme.
 4. The method of claim 1, wherein said first signature scheme is an RSA type scheme.
 5. The method of claim 1, wherein said first signature scheme is a DSS type scheme.
 6. The method of claim 1, further comprising: providing a first challenge value, said first challenge value utilized in generation of said first signed message received from said second computing device.
 7. The method of claim 1, wherein said message utilized in generation of said second signed message comprises a second challenge value provided to said first computing device.
 8. The method of claim 1, wherein said computing device proceeds with a transaction in response to successful verification of said first signed message and said second signed message.
 9. A non-transitory computer-readable medium comprising instructions that are operable when executed by one or more processors to perform operations at a first computing device in a communication system, the operations comprising: receiving a first signed message from a second computing device in said communication system, said first signed message generated using a signing algorithm of a first signature scheme; utilizing a verifying algorithm of said first signature scheme to verify said first signed message; signing a message by utilizing a signing algorithm of a second signature scheme different to said first signature scheme, to generate a second signed message, one of said first and second signature schemes being an elliptic curve signature scheme; sending said second signed message to said second computing device for verification of said second signed message using a verifying algorithm of said second signature scheme.
 10. The computer-readable medium of claim 9, wherein said signing algorithm of said first signature scheme is computationally more difficult than said verifying algorithm of said first signature scheme.
 11. The computer-readable medium of claim 9, wherein said signing algorithm of said second signature scheme is computationally more difficult than said verifying algorithm of said second signature scheme.
 12. The computer-readable medium of claim 9, wherein said first signature scheme is an RSA type scheme.
 13. The computer-readable medium of claim 9, wherein said first signature scheme is a DSS type scheme.
 14. The computer-readable medium of claim 9, the operations further comprising: providing a first challenge value, said first challenge value utilized in generation of said first signed message received from said second computing device.
 15. The computer-readable medium of claim 9, wherein said message utilized in generation of said second signed message comprises a second challenge value provided to said first computing device.
 16. The computer-readable medium of claim 9, wherein said computing device proceeds with a transaction in response to successful verification of said first signed message and said second signed message.
 17. A computing device in a communication system, said computing device comprising one or more processors configured to: receive a first signed message from a second computing device in said communication system, said first signed message generated using a signing algorithm of a first signature scheme; utilize a verifying algorithm of said first signature scheme to verify said first signed message; sign a message by utilizing a signing algorithm of a second signature scheme different to said first signature scheme, to generate a second signed message, one of said first and second signature schemes being an elliptic curve signature scheme; provide said second signed message to said second computing device for verification of said second signed message using a verifying algorithm of said second signature scheme.
 18. The computing device of claim 17, wherein said signing algorithm of said first signature scheme is computationally more difficult than said verifying algorithm of said first signature scheme.
 19. The computing device of claim 17, wherein said signing algorithm of said second signature scheme is computationally more difficult than said verifying algorithm of said second signature scheme.
 20. The computing device of claim 17, wherein said first signature scheme is an RSA type scheme. 